COMMENT ⊗   VALID 00004 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002
C00004 00003	\input basic9
C00008 00004	% \endit
C00009 ENDMK
C⊗;
\input basic9
One goal is to illustrate the first order methods for representing and
proving properties of LISP programs.  These include:

\noindent
\hbox par 330pt{\hangindent 15pt
using first order sentences (recursion equations) and schemata to
define partial recursive functions}


\noindent
\hbox par 330pt{\hangindent 15pt after 1
using first order sentences (recursion equations) and schemata to
define partial recursive functions}

%Page 32, line 18, change "11" to "12".

%*  If you specify hanging indentation with such a boxed paragraph, it applies
%   to the box and not to the paragraph (if any) containing the box. For example,

%	\hbox par 200pt{\hangindent 10 pt <text >}

%will put the specified text into a box 200 points wide, where all lines after
%the first are indented by 10 points at the left.

	\hbox par 200pt{\hangindent 10 pt 
If you specify hanging indentation with such a boxed paragraph, it applies
to the box and not to the paragraph (if any) containing the box. For example,
will put the specified text into a box 200 points wide, where all lines after
the first are indented by 10 points at the left.
}
% \endit